Branching Process Approach for 2-Sat Thresholds

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branching Process approach for 2-SAT thresholds

It is well known that, as n tends to infinity, the probability of satisfiability for a random 2-SAT formula on n variables, where each clause occurs independently with probability α/2n, exhibits a sharp threshold at α = 1. We provide a simple conceptual proof of this fact based on branching process arguments. We also study a generalized 2-SAT model in which each clause occurs independently but ...

متن کامل

Thresholds for Random Geometric k-SAT

We study two geometric models of random k-satisfiability which combine random k-SAT with the Random Geometric Graph: boolean literals are placed uniformly at random or according to a Poisson process in a cube, and for each set of k literals contained in a ball of a given radius, a clause is formed. For k = 2 we find the exact location of the satisfiability threshold (as either the radius or int...

متن کامل

Faster Randomized Branching Algorithms for $r$-SAT

The problem of determining if an r-CNF boolean formula F over n variables is satisifiable reduces to the problem of determining if F has a satisfying assignment with a Hamming distance of at most d from a fixed assignment α [DGH02]. This problem is also a very important subproblem in Schöning’s local search algorithm for r-SAT [Sch99]. While Schöning described a randomized algorithm solves this...

متن کامل

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

متن کامل

Branching process approach for epidemics in dynamic partnership network

We study the spread of sexually transmitted infections (STIs) and other infectious diseases on a dynamic network by using a branching process approach. The nodes in the network represent the sexually active individuals, while connections represent sexual partnerships. This network is dynamic as partnerships are formed and broken over time and individuals enter and leave the sexually active popu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2010

ISSN: 0021-9002,1475-6072

DOI: 10.1239/jap/1285335410